Set-covering and Editing Discrete Data
نویسنده
چکیده
This paper describes new set covering algorithms associated with the DISCRETE edit system. DISCRETE is based on the Fellegi-Holt model (JASA 1976) of editing. A new implicit-edit generation algorithm replaces algorithms of Garfinkel, Kunnathur, and Liepins (Operations Research 1986) and Winkler (1995). The new set-covering algorithms correctly generate implicit edits for large subclasses and reduce computation during implicit-edit generation by as much as two orders of magnitude.
منابع مشابه
An E cient Formulation of Age Comparisons in the DISCRETE Edit System
The DISCRETE edit system, based on the Fellegi and Holt model [1976] of editing, contains two major components: edit generation and error localization. The set covering problem (SCP) is formulated with constraint matrices many times in both components. Therefore, an e cient set covering algorithm is critical to the overall performance of the DISCRETE edit system. The design of a set covering al...
متن کاملAn Efficient Formulation of Age Comparisons in the DISCRETE Edit System
The DISCRETE edit system, based on the Fellegi and Holt model [1976] of editing, contains two major components: edit generation and error localization. The set covering problem (SCP) is formulated with constraint matrices many times in both components. Therefore, an e cient set covering algorithm is critical to the overall performance of the DISCRETE edit system. The design of a set covering al...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملA multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کاملA Selective Covering-Inventory- Routing problem to the location of bloodmobile to supply stochastic demand of blood
Supplying of blood and blood products is one of the most challenging issues in the healthcare system since blood is as extremely perishable and vital good and donation of blood is a voluntary work. In this paper, we propose a two-stage stochastic selective-covering-inventory-routing (SCIR) model to supply whole blood under uncertainty. Here, set of discrete scenarios are used to display uncerta...
متن کامل